Variable neighborhood search based algorithms for crossdock truck assignment

To operate a cross-dock successfully, an efficient assignment of trucks to docks is one the key decisions. In this paper, we are interested in problem, where number exceeds docks. The objective minimize cost transferring goods within while avoiding delivery penalties. This problem being NP-hard, use Variable Neighborhood Search metaheurisitc (VNS) solve it approximately. More specifically, conduct structured empirical study compare several VNS configurations and find which is/are most effective for problem. work, first analyze way search strategy neighborhood operators can be combined framework according their efficiency local search. Then best tested three variants, namely Basic (BVNS), General (GVNS) using VND (B-VND) GVNS Union (U-VND) used order applying these operators. Finally evaluate influence stopping criterion variants. Some significant differences among shown illustrated by conducting Friedman test.